Non-termination analysis of logic programs with integer arithmetics
نویسندگان
چکیده
منابع مشابه
Non-termination analysis of logic programs with integer arithmetics
In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. As a first step towards the analysis of Prolog programs, this paper presents a nonte...
متن کاملTermination Analysis for Logic Programs
I survey termination analysis of logic programs with particular attention to methods for automatically proving termination. I introduce the central concepts of automatic termination analysis and give an overview of the research on other types of termination analysis. I describe the main approaches covered in the literature and compare the accuracy and eeciency of each of them.
متن کاملNon-termination Analysis of Logic Programs Using Types
In recent years techniques and systems have been developed to prove non-termination of logic programs for certain classes of queries. In previous work, we developed such a system based on mode-information and a form of loop checking performed at compile time. In the current paper we improve this technique by integrating type information in the analysis and by applying non-failure analysis and p...
متن کاملA practical analysis of non-termination in large logic programs
A large body of work has been dedicated to termination analysis of logic programs but until recently little has been done to analyze non-termination. In our opinion, explaining nontermination is a much more important task because it can dramatically improve a user’s ability to effectively debug large, complex logic programs without having to abide by punishing syntactic restrictions. Non-termin...
متن کاملA New Approach to Non-termination Analysis of Logic Programs
In this paper, we present a new approach to non-termination analysis of logic programs, based on moded SLDNF-resolution. Moded SLDNF-resolution is a symbolic execution for moded goals, developed for termination prediction. To prove non-termination, we use a complete loop checker to create a finite symbolic derivation tree of a logic program for a moded query. Then, we check if this derivation t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2011
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068411000159